Outing N Etworks : a Daptive S Election of N on - Linear F Unctions for M Ulti - T Ask L Earn

نویسنده

  • Clemens Rosenbaum
چکیده

Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network – for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached. In this way the routing network dynamically composes different function blocks for each input. We employ a collaborative multi-agent reinforcement learning (MARL) approach to jointly train the router and function blocks. We evaluate our model against cross-stitch networks and shared-layer baselines on multi-task settings of the MNIST, mini-imagenet, and CIFAR-100 datasets. Our experiments demonstrate a significant improvement in accuracy, with sharper convergence. In addition, routing networks have nearly constant per-task training cost while cross-stitch networks scale linearly with the number of tasks. On CIFAR100 (20 tasks) we obtain cross-stitch performance levels with an 85% reduction in training time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amitraz Poisoning; A case study

A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...

متن کامل

Sharp Lectureship On " What Is To Be

F o u r of f ive pos i t ions to be fil led in t h e special c lass election l a s t T u e s d a y w e r e t h r o w n into " run -o f f a scheduled f o r Monday f r o m 8 a. m. un t i l 1 p. ra. as sen iors a n d | f r e s h m e n balloted heavi ly desp i t e t h r e a t e n i n g w e a t h e r . In t h e race f o r senior president, Walter Symonds overcame a tremendous early lead piled up by ...

متن کامل

On the solving matrix equations by using the spectral representation

‎The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation‎. ‎We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A‎, ‎X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$‎, ‎which $X$ is unknown matrix‎. ‎Also‎, ‎we suggest the new method for solving quadratic matri...

متن کامل

Polynomially bounded solutions of the Loewner‎ ‎differential equation in several complex variables

‎We determine the‎ ‎form of polynomially bounded solutions to the Loewner differential ‎equation that is satisfied by univalent subordination chains of the‎ ‎form $f(z,t)=e^{int_0^t A(tau){rm d}tau}z+cdots$‎, ‎where‎ ‎$A:[0,infty]rightarrow L(mathbb{C}^n,mathbb{C}^n)$ is a locally‎ ‎Lebesgue integrable mapping and satisfying the condition‎ ‎$$sup_{sgeq0}int_0^inftyleft|expleft{int_s^t‎ ‎[A(tau)...

متن کامل

On a functional equation for symmetric linear operators on $C^{*}$ algebras

‎Let $A$ be a $C^{*}$ algebra‎, ‎$T‎: ‎Arightarrow A$ be a linear map which satisfies the functional equation $T(x)T(y)=T^{2}(xy),;;T(x^{*})=T(x)^{*} $‎. ‎We prove that under each of the following conditions‎, ‎$T$ must be the trivial map $T(x)=lambda x$ for some $lambda in mathbb{R}$: ‎‎ ‎i) $A$ is a simple $C^{*}$-algebra‎. ‎ii) $A$ is unital with trivial center and has a faithful trace such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018